Matrix formulation for non-Abelian families

non-divisibility for abelian groups

Throughout all groups are abelian. We say a group G is n-divisible if nG = G. If G has no non-zero n-divisible subgroups for all n>1 then we say that G is absolutely non-divisible. In the study of class C consisting   all absolutely non-divisible groups such as G, we come across the sub groups T_p(G) = the sum of all p-divisible subgroups and rad_p(G) = the intersection of all p^nG. The proper...

Quasilocal formulation of non-Abelian finite-element gauge theory.

Recently it was shown how to formulate the finite-element equations of motion of a non-Abelian gauge theory, by gauging the free lattice difference equations, and simultaneously determining the form of the gauge transformations. In particular, the gauge-covariant field strength was explicitly constructed, locally, in terms of a path ordered product of exponentials (link operators). On the other...

Families of Abelian Varieties

The Non-Abelian Density Matrix Renormalization Group Algorithm

We describe here the extension of the density matrix renormalization group algorithm to the case where Hamiltonian has a non-Abelian global symmetry group. The block states transform as irreducible representations of the non-Abelian group. Since the representations are multi-dimensional, a single block state in the new representation corresponds to multiple states of the original density matrix...

Non-Abelian Sequenceable Groups Involving ?-Covers

A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...